A New Mapping Heuristic Based on Mean Field Annealing

A new mapping heuristic is developed based on the recently proposed Mean Field Annealing MFA algorithm An e cient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also given Per formance of the proposed MFA algorithm is evaluated in comparison with two well known heuristics Simulated Annealing and Kernighan Lin Results of the exper iments indicate that MFA can be used as an alternative heuristic for solving the mapping problem Inherent parallelism of MFA is exploited by designing an e cient parallel algorithm for the proposed MFA heuristic